Ore-type graph packing problems
نویسندگان
چکیده
We say that n-vertex graphs G1, G2, . . . , Gk pack if there exist injective mappings of their vertex sets onto [n] = {1, . . . , n} such that the images of the edge sets do not intersect. The notion of packing allows one to make some problems on graphs more natural or more general. Clearly, two n-vertex graphs G1 and G2 pack if and only if G1 is a subgraph of the complement G2 of G2. In terms of packing, Dirac’s [2] and Ore’s [3] theorems on hamiltonian cycles in graphs can be stated as follows.
منابع مشابه
Extremal graph packing problems: Ore-type versus Dirac-type
We discuss recent progress and unsolved problems concerning extremal graph packing, emphasizing connections between Dirac-type and Ore-type problems. Extra attention is paid to coloring, and especially equitable coloring, of graphs.
متن کاملAn Ore-type Theorem for Perfect Packings in Graphs
We say that a graph G has a perfect H-packing (also called an H-factor) if there exists a set of disjoint copies of H in G which together cover all the vertices of G. Given a graph H , we determine, asymptotically, the Ore-type degree condition which ensures that a graph G has a perfect H-packing. More precisely, let δOre(H,n) be the smallest number k such that every graph G whose order n is di...
متن کاملThe Regularity Lemma and applications to packings in graphs
In this thesis we investigate applications of Szemerédi’s Regularity Lemma [20]. This result was originally formulated to solve number-theoretical problems. However, we consider its applications in graph theory, in particular to packing results. We begin by introducing some of the basic notions that are needed to understand and use the Regularity Lemma. From this we give an outline of some tool...
متن کاملOn the tractability of some natural packing, covering and partitioning problems
In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuits, forests, spanning trees, (not necessarily spanning) trees and cuts. Given an undirected graph G = (V, E) and two “object types” A and B chosen from the alternatives above, we consider the following questions. Packing problem: can we find an object of type A and one of type B in the edge set E ...
متن کاملHigher-Dimensional Packing with Order Constraints
We present a first exact study on higher-dimensional packing problems with order constraints. Problems of this type occur naturally in applications such as logistics or computer architecture and can be interpreted as higher-dimensional generalizations of scheduling problems. Using graph-theoretic structures to describe feasible solutions, we develop a novel exact branch-and-bound algorithm. Thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 16 شماره
صفحات -
تاریخ انتشار 2007